STUDIES OF INFORMATIONLESS L SYSTEMS. SUMMARY OF DISSERTATION.KARHUMAKI J.1976; ANN. UNIV. TURKU., A1; FINL.; DA. 1976; NO 171; PP. 1-7; BIBL. 10 REF.; ISBN 9516413641Serial Issue

ON COMMUTATIVE DTOL SYSTEMSKARHUMAKI J.1979; THEOR. COMPUTER SCI.; NLD; DA. 1979; VOL. 9; NO 2; PP. 207-220; BIBL. 11 REF.Article

ON STRONGLY CUBE-FREE CO-WORDS GENERATED BY BINARY MORPHISMSKARHUMAKI J.1981; LECT. NOTES COMPUT. SCI.; ISSN 0302-9743; DEU; DA. 1981; NO 117; PP. 182-189; BIBL. 6 REF.Conference Paper

THE FAMILY OF PDOL GROWTH-SETS IS PROPERLY INCLUDED IN THE FAMILY OF DOL GROWTH-SETS.KARHUMAKI J.1974; ANN. ACAD. SCI. FENN., A1; FINL.; DA. 1974; NO 590; PP. 1-9; BIBL. 8 REF.Article

A property of three-element codesKARHUMAKI, J.Theoretical computer science. 1985, Vol 41, Num 2-3, pp 215-222, issn 0304-3975Article

On three-element codesKARHUMAKI, J.Theoretical computer science. 1985, Vol 40, Num 1, pp 3-11, issn 0304-3975Article

ON THE EQUALITY SETS FOR HOMOMORPHISMS ON FREE MONOIDS WITH TWO GENERATORSCULIK K II; KARHUMAKI J.1980; R.A.I.R.O. INFORM. THEOR.; ISSN 0399-0540; FRA; DA. 1980; VOL. 14; NO 4; PP. 349-369; ABS. FRE; BIBL. 13 REF.Article

INTERACTIVE L SYSTEMS WITH ALMOST INTERACTION LESS BEHAVIOURCULIK K II; KARHUMAKI J.1979; INFORM. AND CONTROL; USA; DA. 1979; VOL. 43; NO 1; PP. 83-100; BIBL. 7 REF.Article

INTERACTIVE L SYSTEMS WITH ALMOST INTERACTIONLESS BEHAVIOURCULIK K II; KARHUMAKI J.1979; LECTURE NOTES COMPUTER SCI.; DEU; DA. 1979; VOL. 74; PP. 246-257; BIBL. 8 REF.Conference Paper

NOTE ON DOL LENGTH SETS.EHRENFEUCHT A; KARHUMAKI J; ROZENBERG G et al.1978; DISCRETE MATH.; NETHERL.; DA. 1978; VOL. 22; NO 3; PP. 233-242; BIBL. 10 REF.Article

Multiplicities : a deterministic view of nondeterminismKARHUMÄKI, J.Theoretical computer science. 1992, Vol 98, Num 1, pp 15-25, issn 0304-3975Conference Paper

On totalistic systolic networksCULIK, K. II; KARHUMAKI, J.Information processing letters. 1988, Vol 26, Num 5, pp 231-236, issn 0020-0190Article

The Ehrenfeucht conjecture: a compactness claim for finitely generated free monoidsKARHUMAKI, J; SALOMAA, A.Theoretical computer science. 1984, Vol 29, Num 3, pp 285-308, issn 0304-3975Article

A note of the equivalence problem of rational formal power seriesCULIK, K. II; KARHUMAKI, J.Information processing letters. 1986, Vol 23, Num 1, pp 29-31, issn 0020-0190Article

Inverse morphic equivalence on languagesKARHUMAKI, J; WOOD, D.Information processing letters. 1984, Vol 19, Num 5, pp 213-218, issn 0020-0190Article

A simple undecidable problem: the inclusion problem for finite substitutions on ab*cKARHUMÄKI, J; LISOVIK, L. P.Information and computation (Print). 2003, Vol 187, Num 1, pp 40-48, issn 0890-5401, 9 p.Article

On the equivalence of compositions of morphisms and inverse morphisms on regular languagesKARHUMAKI, J; KLEIJN, H. C. M.R.A.I.R.O. Informatique théorique. 1985, Vol 19, Num 3, pp 203-211, issn 0399-0540Article

On continuous functions computed by finite automataDERENCOURT, D; KARHUMAKI, J; LATTEUX, M et al.Informatique théorique et applications (Imprimé). 1994, Vol 28, Num 3-4, pp 397-403, issn 0988-3754Article

On morphic generation of regular languagesHARJU, T; KARHUMAKI, J; KLEIJN, H. C. M et al.Discrete applied mathematics. 1986, Vol 15, Num 1, pp 55-60, issn 0166-218XArticle

Polynomial size test sets for contex-free languagesKARHUMÄKI, J; PLANDOWSKI, W; RYTTER, W et al.Journal of computer and system sciences (Print). 1995, Vol 50, Num 1, pp 11-19, issn 0022-0000Article

Efficient constructions of test sets for regular and context-free languagesKARHUMÄKI, J; RYTTER, W; JAROMINEK, S et al.Theoretical computer science. 1993, Vol 116, Num 2, pp 305-316, issn 0304-3975Article

Equations over finite sets of words and equivalence problems in automata theory = Equations sur les ensembles finis de mots et problèmes d'équivalence en théorie d'automateKARHUMÄKÏ, J.Theoretical computer science. 1993, Vol 108, Num 1, pp 103-118, issn 0304-3975Conference Paper

On the power of synchronization in parallel computationsHROMKOVIC, J; KARHUMÄKI, J; ROVAN, B et al.Discrete applied mathematics. 1991, Vol 32, Num 2, pp 155-182, issn 0166-218XArticle

A proof of the extended Duval's conjectureHOLUB, Stepan.Theoretical computer science. 2005, Vol 339, Num 1, pp 61-67, issn 0304-3975, 7 p.Conference Paper

Generalized factorizations of words and their algorithmic propertiesKARHUMÄKI, J; PLANDOWSKI, W; RYTTER, W et al.Theoretical computer science. 1999, Vol 218, Num 1, pp 123-133, issn 0304-3975Conference Paper